Size versus fairness in the assignment problem
نویسندگان
چکیده
منابع مشابه
Size versus fairness in the assignment problem
When not all objects are acceptable to all agents, maximizing the number of objects actually assigned is an important design concern. We compute the guaranteed size index of the Probabilistic Serial mechanism, i.e., the worst ratio of the actual expected size to the maximal feasible size. It converges decreasingly to 1 − 1e ' 63.2% as the maximal size increases. It is the best index of any Envy...
متن کاملSize versus versus fairness in the assignment problem
When not all objects are acceptable to all agents, maximizing the number of objects actually assigned is an important design concern. We compute the guaranteed size index of the Probabilistic Serial mechanism, i.e., the worst ratio of the actual expected size to the maximal feasible size. It converges decreasingly to 1 − 1e ' 63.2% as the maximal size increases. It is the best index of any Envy...
متن کاملSize versus fairness and strategyproofness in the assignment problem
When we assign objects to economic agents who may not …nd all objects acceptable, an important design concern is to maximize the size of the match, i.e., the number of agents who receive an acceptable object. Think of assigning children to schools, teaching assistants to professors, and rooms to students. It is immediately clear that this MaxSize objective is compatible with e¢ ciency, but not ...
متن کاملSize Versus Stability in the Marriage Problem
Given an instance I of the classical Stable Marriage problem with Incomplete preference lists (smi), a maximum cardinality matching can be larger than a stable matching. In many large-scale applications of smi, we seek to match as many agents as possible. This motivates the problem of finding a maximum cardinality matching in I that admits the smallest number of blocking pairs (so is “as stable...
متن کاملEigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem
It was recently demonstrated that a well-known eigenvalue bound for the Quadratic Assignment Problem (QAP) actually corresponds to a semideenite programming (SDP) relaxation. However, for this bound to be computationally useful the assignment constraints of the QAP must rst be eliminated, and the bound then applied to a lower-dimensional problem. The resulting \projected eigenvalue bound" is on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Games and Economic Behavior
سال: 2015
ISSN: 0899-8256
DOI: 10.1016/j.geb.2014.11.006